A Rule-Constructive Geometric Constraint Solver

نویسندگان

  • R. Juan-Arinyo
  • Antoni Soto
چکیده

This work reports on the implementation of a two-dimensional, varia-tional geometric constraint solver based on a constructive approach. The solver computes a solution in two phases. First, using rewrite rules, the solver builds a sequence of construction steps. Then, the construction steps are carried out to generate an instance of the geometric object for the current dimension values. We discuss some issues concerning the data representation and the rules used. Then a simple example illustrates how the solver works. Finally we give a correctness proof of the solver.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Set of Rules for a Constructive Geometric Constraint Solver

This paper presents the set of constructive rules used by a two-dimensional, variational geometric constraint solver based on a constructive approach. The main goal in deening the rules has been to keep the set of rules as small as possible while being able to yield a useful solver with a large enough domain of solvable constructions. The rules can be classiied according to their functionality ...

متن کامل

A 2D geometric constraint solver using a graph reduction method

Keywords: Geometric constraints Modeling by constraints Graph-constructive solver Decomposition–recombination (DR) planning Graph algorithms Under-constrained problems a b s t r a c t Modeling by constraints enables users to describe shapes by specifying relationships between geometric elements. These relationships are called constraints. A constraint solver derives then automatically the desig...

متن کامل

A Geometric Relaxation Solver for Parametric Constraint-Based Models

In this paper, a new relaxation algorithm for solving geometric constraint-based models is proposed. The algorithm starts from a constructive symbolic representation of objects (Constructive Parametric Solid Model, CPSM) and proceeds by iterative relaxation of the geometric constraints. Models that can be reduced to distance and angle constraints can be handled. A new algorithm based on an iter...

متن کامل

Correctness proof of a geometric constraint solver

We present a correctness proof of a graph-directed variational geometric constraint solver. First, we prove that the graph reduction that establishes the sequence in which to apply the construction steps de nes a terminating con uent reduction system, in the case of well-constrained graphs. For overconstrained problems there may not be a unique normal form. Underconstrained problems, on the oth...

متن کامل

A Two-body Solver for Assembly Modelling

Assembly modelling deals with the spatial joining of rigid bodies in 3D-space for which constraint based modelling is a proven approach. The existing geometric constraint solvers do not satisfy all needs, there are still challenges for research. The two-body-problem (constraint intersection) and the three-body-problem (constraint composition) are subproblems which have exploitable properties on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995